Collaborative Programming: Applications of Logic and Automated Reasoning
نویسنده
چکیده
Collaborative Programming is characterized by groups of people issuing instructions to computer systems. Collaborative Programming languages differ from traditional programming languages because instruction sets can be incomplete and conflicting, and more of the burden for efficient execution is placed on the computer system. This paper introduces Collaborative Programming and through the discussion of two practical examples argues that tools from logic and automated reasoning form a good foundation for Collaborative Programming technology while at the same time illustrating the need for nonstandard automated reasoning techniques.
منابع مشابه
Distributed abductive reasoning with constraints
Abductive reasoning is a powerful inference mechanism that can generate conditional proofs. The combination of Abduction and Logic Programming (ALP) [5] has many known applications, such as planning, scheduling, cognitive robotics, medical diagnosis and policy analysis [3]. However, most abductive frameworks [7, 4, 8] rely on a centrally executed proof procedure whereas many of the application ...
متن کاملProbabilistic Logic Programming and Bayesian Networks
We present a probabilistic logic programming framework that allows the representation of conditional probabilities. While conditional probabilities are the most commonly used method for representing uncertainty in probabilistic expert systems, they have been largely neglected by work in quantitative logic programming. We de-ne a xpoint theory, declarative semantics, and proof procedure for the ...
متن کاملA general theory of confluent rewriting systems for logic programming and its applications
Recently, Brass and Dix showed (Journal of Automated Reasoning 20(1), 1998) that the wellfounded semantics WFS can be deened as a connuent calculus of transformation rules. This lead not only to a simple extension to disjunctive programs (Journal of Logic Programming 38(3), 1999), but also to a new computation of the wellfounded semantics which is linear for a broad class of programs. We take t...
متن کاملConstraint Programming Architectures: Review and a New Proposal
Most automated reasoning tasks with practical applications can be automatically reformulated into a constraint solving task. A constraint programming platform can thus act as a unique, underlying engine to be reused for multiple automated reasoning tasks in intelligent agents and systems. We identify six key requirements for such platform: expressive task modeling language, rapid solving method...
متن کاملAutomated Abduction in Scientific Discovery
The role of abduction in the philosophy of science has been well studied in recent years and has led to a deeper understanding of many formal and pragmatic issues [1, 2, 3, 4, 5]. This paper is written from the point of view that real applications are now needed to help consolidate what has been learned so far and to inspire new developments. With an emphasis on computational mechanisms, it exa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008